Quantum-Resistant Diffie-Hellman Key Exchange from Supersingular Elliptic Curve Isogenies
نویسنده
چکیده
Possibility of the emergence of quantum computers in the near future, pose a serious threat against the security of widely-used public key cryptosystems such as RSA or Elliptic Curve Cryptography (ECC). Algorithms involving isogeny computations on supersingular elliptic curves have been shown to be difficult to break, even to quantum computers. Thus, isogeny-based protocols represent promising solution to provide quantum-resistant cryptography. This paper, explores a relatively new scheme which allows two parties to generate DH secret shared using isogenies between supersingular elliptic curves. The reason behind using supersingular elliptic curve, is the development of a sub-exponential time quantum algorithm which is able to break isogenies between ordinary elliptic curves. On the other hand, in the case of supersingular elliptic curves, the fastest known quantum attack remains exponential, because of non-commutativity of the endomorphism ring. However, the noncommutativity feature causes the main technical difficulty in the supersingular case, because Diffie-Hellman key-exchange protocol require commutativity of elements to generate shared secret. In this paper, solution to this problem is also investigates and it is shown that providing the outputs of the isogeny on certain points can be deployed to overcome the non-commutativity problem in Diffie-Hellman Key-Exchange protocol.
منابع مشابه
Diffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملPublic-Key Cryptosystem Based on Isogenies
A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key...
متن کاملSide-Channel Attacks on Quantum-Resistant Supersingular Isogeny Diffie-Hellman
In this paper, we present three side-channel attacks on the quantum-resistant supersingular isogeny Di e-Hellman (SIDH) key exchange protocol. These re ned power analysis attacks target the representation of a zero value in a physical implementation of SIDH to extract bits of the secret key. To understand the behavior of these zero-attacks on SIDH, we investigate the representation of zero in t...
متن کاملA Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies
We derive a new formula for computing arbitrary odd-degree isogenies between elliptic curves in Montgomery form. The formula lends itself to a simple and compact algorithm that can efficiently compute any low odd-degree isogenies inside the supersingular isogeny Diffie-Hellman (SIDH) key exchange protocol. Our implementation of this algorithm shows that, beyond the commonly used 3-isogenies, th...
متن کامل